Classical simulations of Abelian-group normalizer circuits with intermediate measurements
نویسندگان
چکیده
منابع مشابه
Classical simulations of Abelian-group normalizer circuits with intermediate measurements
Quantum normalizer circuits were recently introduced as generalizations of Clifford circuits [1]: a normalizer circuit over a finite Abelian group G is composed of the quantum Fourier transform (QFT) over G, together with gates which compute quadratic functions and automorphisms. In [1] it was shown that every normalizer circuit can be simulated efficiently classically. This result provides a n...
متن کاملEfficient classical simulations of quantum fourier transforms and normalizer circuits over Abelian groups
The quantum Fourier transform (QFT) is an important ingredient in various quantum algorithms which achieve superpolynomial speed-ups over classical computers. In this paper we study under which conditions the QFT can be simulated efficiently classically. We introduce a class of quantum circuits, called normalizer circuits: a normalizer circuit over a finite Abelian group is any quantum circuit ...
متن کاملNormalizer Circuits and Quantum Computation
In this thesis, we introduce new models of quantum computation to study the potential and limitations of quantum computer algorithms. Our models are based on algebraic extensions of the qubit Clifford gates (CNOT, Hadamard and π/4-phase gates) and Gottesman’s stabilizer formalism of quantum codes. We give two main kinds of technical contributions with applications in quantum algorithm design, c...
متن کاملCommuting quantum circuits: efficient classical simulations versus hardness results
The study of quantum circuits composed of commuting gates is particularly useful to understand the delicate boundary between quantum and classical computation. Indeed, while being a restricted class, commuting circuits exhibit genuine quantum effects such as entanglement. In this paper we show that the computational power of commuting circuits exhibits a surprisingly rich structure. First we sh...
متن کاملThe computational power of normalizer circuits over black-box groups
This work presents a precise connection between Clifford circuits, Shor’s factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for solving Abelian hidden subgroup problems. We show that all these different forms of quantum computation belong to a common new restricted model of quantum operations that we call black-box normalizer circuits. To define ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2014
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic14.3-4-1